Search results for "quantum [statistics]"
showing 10 items of 4295 documents
Frequency and temperature dependence of the electrical conductivity of KTaO3; Li and PbTiO3; La, Cu: Indication of a low temperature polaron mechanism
2008
Abstract Recently, the concept of polarons has again been at the focus of solid-state research, as it can constitute the basis for understanding the high-temperature superconductivity or the colossal magnetoresistance of materials. More than a decade ago there were some indications that polarons play an important role in explaining low temperature maxima in imaginary part of the dielectric constant e ″ ( T ) in ABO3 perovskites. In the present work we report the ac electrical conductivities of KTaO3; Li and PbTiO3; La, Cu and their frequency and temperature dependence. The real part of the complex ac conductivity was found to follow the universal dielectric response σ ′ ∝ ν s . A detailed t…
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
2007
For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.
Ambainis-Freivalds’ Algorithm for Measure-Once Automata
2001
An algorithm given by Ambainis and Freivalds [1] constructs a quantum finite automaton (QFA) with O(log p) states recognizing the language Lp = {ai| i is divisible by p} with probability 1 - Ɛ , for any Ɛ > 0 and arbitrary prime p. In [4] we gave examples showing that the algorithm is applicable also to quantum automata of very limited size. However, the Ambainis-Freivalds algoritm is tailored to constructing a measure-many QFA (defined by Kondacs andWatrous [2]), which cannot be implemented on existing quantum computers. In this paper we modify the algorithm to construct a measure-once QFA of Moore and Crutchfield [3] and give examples of parameters for this automaton. We show for the lang…
Improved Constructions of Quantum Automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.
Span programs for functions with constant-sized 1-certificates
2012
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O(n13/10) of the best p…
Quantum Queries on Permutations with a Promise
2009
This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …
Enlarging the gap between quantum and classical query complexity of multifunctions
2013
Quantum computing aims to use quantum mechanical effects for the efficient performance of computational tasks. A popular research direction is enlarging the gap between classical and quantum algorithm complexity of the same computational problem. We present new results in quantum query algorithm design for multivalued functions that allow to achieve a large quantum versus classical complexity separation. To compute a basic finite multifunction in a quantum model only one query is enough while classically three queries are required. Then, we present two generalizations and a modification of the original algorithm, and obtain the following complexity gaps: Q UD (M′) ≤ N versus C UD (M′) ≥ 3N,…
A knot without tritangent planes
1991
We show, with computations aided by a computer, that the (3,2)-curve on some standard torus (which topologically is the trefoil knot) has no tritangent planes, thus answering in the negative a conjecture of M. H. Freedman.
Structure of Kac-Moody groups
2008
For a phys ic i s t , a Kac-Moody algebra is the current algebra of a quantum f i e l d theory model in I + I space-time dimensions with an in terna l symmetry group G [ I ] . A More p rec ise ly , l e t ~ be the Lie algebra of G . The Kac-Moody algebra g is a one-dimensional central extension of the loop algebra Map(S I , g ) . I f f l ' f2 C Map(S I ,~ ) , then the commutator is defined point -wise,
Novel patterns for vector mesons from the large-Nc limit
2008
We report on a relation between the decay constants of \rho-like J^{PC}=1^{--} vector mesons, which arises solely from the perturbative analysis of the VV, TT and VT correlators at order \alpha_s^0 in the large-N_c limit. We find f_{V}^T/f_{V}=1/\sqrt{2} for highly excited states together with a pattern of alternation in sign. Quite remarkably, recent lattice determinations reported f_{\rho}^T/f_{\rho}=0.72(2), in excellent agreement with our large-N_c result. This seems to suggest a pattern like f_{Vn}^T/f_{Vn}=(-1)^n/\sqrt{2} for the whole (1^{--}) states. In order to test this conjecture in real QCD we construct a set of spectral sum rules, which turn out to comply nicely with this scena…